Zeta functions of edge-free quotients of graphs

نویسندگان

چکیده

We define the Ihara zeta function ζ(u,X) and Artin–Ihara L-function of quotient graph groups X=Y//G, where G is a group acting on finite Y with trivial edge stabilizers. determine relationship between primes X show that projection map Y→X can be naturally viewed as an unramified Galois covering graphs groups. evaluated at regular representation equal to ζ(u,Y), divides ζ(u,Y). derive two-term three-term determinant formulas for L-functions, compute several examples L-functions edge-free quotients tetrahedron K4.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the edge-connectivity of C_4-free graphs

Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

متن کامل

Quotients of Normal Edge-Transitive Cayley Graphs

The symmetry properties of mathematical structures are often important for understanding these structures. Graphs sometimes have a large group of symmetries, especially when they have an algebraic construction such as the Cayley graphs. These graphs are constructed from abstract groups and are vertex-transitive and this is the reason for their symmetric appearance. Some Cayley graphs have even ...

متن کامل

Weighted zeta functions of graphs

We define a weighted zeta function of a digraph and a weighted L-function of a symmetric digraph, and give determinant expressions of them. Furthermore, we give a decomposition formula for the weighted zeta function of a g-cyclic -cover of a symmetric digraph for any finite group and g ∈ . A decomposition formula for the weighted zeta function of an oriented line graph L(G̃) of a regular coverin...

متن کامل

Zeta Functions of Finite Graphs

Poles of the Ihara zeta function associated with a finite graph are described by graph-theoretic quantities. Elementary proofs based on the notions of oriented line graphs, Perron-Frobenius operators, and discrete Laplacians are provided for Bass’s theorem on the determinant expression of the zeta function and Hashimoto’s theorems on the pole at u = 1.

متن کامل

Convergence of Zeta Functions of Graphs

The L-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y , the normalized zeta functions of the finite graphs converge to the L-zeta function of Y . Introduction Associated to any finite graph X there is a zeta function Z(X,u), u ∈ C. It is defined as an infinite product but shown (in various diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2021

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2021.07.009